#include<bits/stdc++.h>
#define int long long
#define ls(x) ((x)*2)
#define rs(x) ((x)*2+1)
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define For(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define Rof(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define rep(i,  b) for(int i=1,i##end=b;i<=i##end;i++)
using namespace std;
const int N=1e6+5,base=999983,Mod=998244353;
//char buf[(1<<21)+5],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline void chmx(int &x,int y){(x<y)&&(x=y);}
inline void chmn(int &x,int y){(x>y)&&(x=y);}
inline void Add(int &x,int y){(x=x+y+Mod)%=Mod;}
inline int read(){
	int f=0,x=0;
	char ch=getchar();
	while(!isdigit(ch)){f|=(ch=='-');ch=getchar();}
	while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return f?-x:x;
}
void print(int n){
    if(n<0){
        putchar('-');
        n*=-1;
    }
    if(n>9) print(n/10);
    putchar(n%10+'0');
}
int n;
int a[N],qzh[N];
int f[N][2];
map<int,int>mp[2];
int dfs(int x,int p,int op){
	if(x==n) return p;
	if(mp[op][x]!=-1){
		return mp[op][x];
	}
	int ans=(op?1e16:-1e16);
	For(i,x+1,n){
		if(op==0) ans=max(ans,dfs(i,p-qzh[i-1]+qzh[x]+a[i],1));
		if(op==1) ans=min(ans,dfs(i,p+qzh[i-1]-qzh[x]-a[i],0));
		
	} 
//	cout<<op<<" "<<x<<" "<<ans<<endl; 
	return mp[op][x]=ans;
}
signed main(){
	freopen("pockets.in","r",stdin);
	freopen("pockets.out","w",stdout);
	// ios::sync_with_stdio(false);
	// cin.tie(0); cout.tie(0);
	n=read();
	For(i,1,n-1) a[i]=read(),qzh[i]=qzh[i-1]+a[i];
	int Q=read();
	dfs(2,a[1]-a[2],0);
	while(Q--){
		For(i,1,n) mp[0][i]=mp[1][i]=-1;
		int k=read();
		qzh[n]-=a[n];
		qzh[n]+=k;
		a[n]=k;
		printf("%lld\n",dfs(2,a[1]-a[2],0)); 
	}
#ifdef LOCAL
    Debug("\nMy Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif
	return 0;
}

